Galois groups of iterates of some unicritical polynomials

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some polynomials over Q(t) and their Galois groups

Examples of polynomials with Galois group over Q(t) corresponding to every transitive group through degree eight are calculated, constructively demonstrating the existence of an infinity of extensions with each Galois group over Q through degree eight. The methods used, which for the most part have not appeared in print, are briefly discussed.

متن کامل

Galois groups of multivariate Tutte polynomials

The multivariate Tutte polynomial ẐM of a matroid M is a generalization of the standard two-variable version, obtained by assigning a separate variable ve to each element e of the ground set E. It encodes the full structure of M . Let v = {ve}e∈E , let K be an arbitrary field, and suppose M is connected. We show that ẐM is irreducible over K(v), and give three self-contained proofs that the Gal...

متن کامل

Orbit Portraits of Unicritical Antiholomorphic Polynomials

Orbit portraits were introduced by Goldberg and Milnor as a combinatorial tool to describe the patterns of all periodic dynamical rays landing on a periodic cycle of a quadratic polynomial. This encodes information about the dynamics and the parameter spaces of these maps. We carry out a similar analysis for unicritical antiholomorphic polynomials, and give an explicit description of the orbit ...

متن کامل

Combinatorial Rigidity for Unicritical Polynomials

We prove that any unicritical polynomial fc : z 7→ z+c which is at most finitely renormalizable and has only repelling periodic points is combinatorially rigid. It implies that the connectedness locus (the “Multibrot set”) is locally connected at the corresponding parameter values. It generalizes Yoccoz’s Theorem for quadratics to the higher degree case. Stony Brook IMS Preprint #2005/05 July 2005

متن کامل

Computing Galois Groups with Generic Resolvent Polynomials

Given an arbitrary irreducible polynomial f with rational coefficients it is difficult to determine the Galois group of the splitting field of that polynomial. When the roots of f are easy to calculate, there are a number of “tricks” that can be employed to calculate this Galois group. If the roots of f are solvable by radicals, for example, it is often easy to calculate by hand the Q-fixing au...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Acta Arithmetica

سال: 2017

ISSN: 0065-1036,1730-6264

DOI: 10.4064/aa8599-8-2017